This is certainly more convenient than the traversal methods i discussed 這無疑比我所討論的遍歷方法更方便。
Method for comparing names and namespace uris ; instead , an application can choose to write its own traversal methods that can use java 方法比較名稱和名稱空間uri ,以查找節(jié)點(diǎn)。相反,應(yīng)用程序可以選擇編寫它自己的遍歷方法,在這個(gè)遍歷方法中使用java
24 frisken s f , perry r n . simple and efficient traversal methods for quadtrees and octrees . j . graphics tools , 2002 , 7 : 1 - 11 . 25 zhang h , hoff k . fast backface culling using normal masks 實(shí)驗(yàn)表明,新方法能將順序點(diǎn)模型樹的繪制效率提高20 % 64 . 6 % ,并且越近觀察模型或模型中的遮擋關(guān)系越復(fù)雜時(shí),新方法的加速比更高。